Label-guided graph exploration by a finite automaton
نویسندگان
چکیده
منابع مشابه
Label-Guided Graph Exploration with Adjustable Ratio of Labels
The graph exploration problem is to visit all the nodes of a connected graph by a mobile entity, e.g., a robot. The robot has no a priori knowledge of the topology of the graph or of its size. Cohen et al. [3] introduced label guided graph exploration which allows the system designer to add short labels to the graph nodes in a preprocessing stage; these labels can guide the robot in the explora...
متن کاملBCK-ALGEBRAS AND HYPER BCK-ALGEBRAS INDUCED BY A DETERMINISTIC FINITE AUTOMATON
In this note first we define a BCK‐algebra on the states of a deterministic finite automaton. Then we show that it is a BCK‐algebra with condition (S) and also it is a positive implicative BCK‐algebra. Then we find some quotient BCK‐algebras of it. After that we introduce a hyper BCK‐algebra on the set of all equivalence classes of an equivalence relation on the states of a deterministic finite...
متن کاملPiecemeal Graph Exploration by a Mobile Robot
We study how a mobile robot can learn an unknown environment in a piecemeal manner The robot s goal is to learn a complete map of its environment while satisfying the constraint that it must return every so often to its starting position for refueling say The environment is modeled as an arbitrary undirected graph which is initially unknown to the robot We assume that the robot can distinguish ...
متن کاملMulti-View Budgeted Learning under Label and Feature Constraints Using Label-Guided Graph-Based Regularization
Budgeted learning under constraints on both the amount of labeled information and the availability of features at test time pertains to a large number of real world problems. Ideas from multi-view learning, semisupervised learning, and even active learning have applicability, but a common framework whose assumptions fit these problem spaces is non-trivial to construct. We leverage ideas from th...
متن کاملThe Nondeterministic Complexity of a Finite Automaton
We deene the nondeterministic complexity of a nite automaton and show that there exist, for any integer p 1, automata which need (k 1=p) nondeterministic transitions to spell words of length k. This leads to a subdivision of the family of recognizable M-subsets of a free monoid into a hierarchy whose members are indexed by polynomials, where M denotes the Min{Plus semiring.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2008
ISSN: 1549-6325,1549-6333
DOI: 10.1145/1383369.1383373